Modified GPT Cryptosystem for Information Network Security
نویسندگان
چکیده
To provide information security in network we use the public key GPT (Gabidulin–Paramonov–Tretiyakov) cryptosystem based on rank codes. This cryptosystem was the subject of several attacks. Some of them were structural attacks, others were decoding attacks. In our opinion the most dangerous are structural attacks because decoding attacks can be prevented by proper choice of parameters. To prevent structural attacks, we change some of its secret keys. We called the modified GPT cryptosystem as GPT-M. We consider network communication with adversaries where we use the GPT-M cryptosystem and obtain conditions for network security.
منابع مشابه
Decoding Interleaved Gabidulin Codes and Ciphertext-Security for GPT variants
In this paper we view interleaved Gabidulin codes and describe how to correct errors up to a rank equal to the amount of redundancy of the code with high probability. We give a detailed proof for our estimation of the probability of correct decoding. In a second part, we view the application to variants of the GPT cryptosystem. For GGPT this leads to an efficient attack on the remaining secure ...
متن کاملPrivate-Key Cryptosystems Based on Rank Metric
An analogue of McEliece’s cryptosystem, the Gabidulin-Paramonov-Trejtakov (GPT) public-key cryptosystem is based on rank-metric-based Gabidulin codes instead of Goppa codes. The GPT cryptosystem has attracted steady attention since it is much more robust against the decoding attacks and can therefore achieve the same level of security with much smaller keys. The key sizes, nonetheless, may stil...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملModified Niederreiter type of GPT cryptosystem based on reducible rank codes
GPT public key cryptosystem was proposed by Gabidulin, Paramonov and Tretjakov in 1991. This cryptosystem is based on rank error correcting codes. The main advantage of using rank codes in cryptography is that, it has smaller key size as compared to other code based public key cryptosystems. Several attacks against this system were published and some modifications were also proposed withstandin...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کامل